discrete Fourier transform - definizione. Che cos'è discrete Fourier transform
Diclib.com
Dizionario ChatGPT
Inserisci una parola o una frase in qualsiasi lingua 👆
Lingua:

Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT

In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:

  • come viene usata la parola
  • frequenza di utilizzo
  • è usato più spesso nel discorso orale o scritto
  • opzioni di traduzione delle parole
  • esempi di utilizzo (varie frasi con traduzione)
  • etimologia

Cosa (chi) è discrete Fourier transform - definizione


Discrete Fourier transform         
  • Discrete transforms embedded in time & space.
  • FFT]] algorithm computes one cycle of the DFT and its inverse is one cycle of the DFT inverse.
TECHNIQUE USED IN ADVANCED MATHEMATICS
Discrete fourier transform; Generalized discrete Fourier transform; Discrete Fourier Transform; Shifted DFT; Centered DFT; Offset DFT; DTFS; Inverse discrete Fourier transform; Circular convolution theorem; Cross-correlation theorem; Circular cross-correlation
In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence.
discrete Fourier transform         
  • Discrete transforms embedded in time & space.
  • FFT]] algorithm computes one cycle of the DFT and its inverse is one cycle of the DFT inverse.
TECHNIQUE USED IN ADVANCED MATHEMATICS
Discrete fourier transform; Generalized discrete Fourier transform; Discrete Fourier Transform; Shifted DFT; Centered DFT; Offset DFT; DTFS; Inverse discrete Fourier transform; Circular convolution theorem; Cross-correlation theorem; Circular cross-correlation
<mathematics> (DFT) A Fourier transform, specialized to the case where the abscissas are integers. The DFT is central to many kinds of signal processing, including the analysis and compression of video and sound information. A common implementation of the DFT is the {Fast Fourier Transform} (FFT). See also discrete cosine transform. (1997-03-10)
Discrete Fourier transform (general)         
GENERALIZATION OF FOURIER TRANSFORM TO ANY RING
Number-theoretic transform; Number theoretic transform; Discrete weighted transform; Discrete Fourier transform (general)
In mathematics, the discrete Fourier transform over an arbitrary ring generalizes the discrete Fourier transform of a function whose values are complex numbers.